Statement for Karl - Dieter Crisman

نویسنده

  • Karl-Dieter Crisman
چکیده

My current research is primarily in the mathematics of voting. This discipline lies at the interface of mathematics, political science, and economics, though it has connections to any field which could involve aggregation of preferences, such as statistics or psychology. It also is a proven, fertile field for undergraduate research. The math of voting, in its classical form, asks questions about what is and isn’t possible with various voting methods; these include the usual plurality vote, a runoff system such as in television ‘reality shows’ or primaries, or weighted voting systems such as the Borda Count and those used in collegiate sports polls. The seminal theorems are intriguing even to the non-expert. Arrow proved in the early 50’s (essentially) that, for three or more candidates, there does not exist a voting system which fulfills the most basic criteria of fairness (symmetry, really) and simultaneously agrees with all pairwise comparisons between candidates. Twenty years later, Gibbard and Satterthwaite proved that there also does not exist such a system which cannot be manipulated by insincere voting (for an example from the most recent presidential campaign, such as an Obama supporter supporting Clinton in the primary as more ‘electable’). Before describing current work, we need a little notation. The basic concept is that of a voting profile, which is a collection of voters along with their preferences. For instance, the set {4, 3, 1, 0, 0, 0} is often thought of as representing a profile where four voters prefer A B C, three support A C B, and one has the preference order C A B. If we think of a profile as a vector, we can think of the set of all profiles as a vector space. It turns out that there are geometric decompositions of this profile space which are highly profitable in analyzing different methods and their relative strengths (most notably done by D. Saari), and it further turns out that one can re-encode these ideas algebraically in terms of representation theory (e.g., as done by M. Orrison and his students); the portion of a profile space which is subject to the fewest paradoxes is called the Basic or Borda portion. My work tries to answer new questions from these algebraic/geometric points of view, including the following:

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Open Source Software and Christian Thought

This article introduces the distinction between proprietary and open source software, and discusses connections with Christian thought. It argues that this distinction is important for Christians to understand, and covers four main resonance points between Christian thought and open source software: stewardship, building community, helping the underprivileged, and promoting creativity. It also ...

متن کامل

The Borda Count, the Kemeny Rule, and the Permutahedron

A strict ranking of n items may profitably be viewed as a permutation of the objects. In particular, social preference functions may be viewed as having both input and output be such rankings (or possibly ties among several such rankings). A natural combinatorial object for studying such functions is the permutahedron, because pairwise comparisons are viewed as particularly important. In this p...

متن کامل

Representation Theory of the Symmetric Group in Voting Theory and Game Theory

This paper is a survey of some of the ways in which the representation theory of the symmetric group has been used in voting theory and game theory. In particular, we use permutation representations that arise from the action of the symmetric group on tabloids to describe, for example, a surprising relationship between the Borda count and Kemeny rule in voting. We also explain a powerful repres...

متن کامل

Chow groups of Zero-Cycles Relative to Hyperplane Arrangements

The schemes Spec (k[x0, . . . , xn]/( P xi − 1)) were used homologically by Bloch to define higher Chow groups. We prove an alternate, ‘classical’, characterization of higher Chow groups, in the zero-cycle case over a field k, in terms of divisors of functions on curves. Since an arrangement of hyperplanes A is given by a finite number of linear forms on affine space, such as the n + 1 forms xi...

متن کامل

Decomposition behavior in aggregated data sets

One kind of aggregation of nonparametric data sets involves combining two (or more) sets with the same structure, but with no interweaving of values. For instance, one could have prices of the same product at different stores on different days, but before and after a significant sales tax hike. In this paper, looking at the case of three ‘candidates’, we give a precise computation of how decomp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009